Pseudo Quasi-3 Designs and their Applications to Coding Theory

نویسنده

  • Carl Bracken
چکیده

We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self complementary codes. In this article we give a construction of an infinite family of pseudo quasi-3 designs whose residual designs allow us to construct a family of codes with a new parameter set that meet the Grey Rankin bound.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognizing Stalactites and Stalagmites of ELT Vodcasting in Teacher Education Based on Activity Theory and Visual Thinking Strategies

Teachers need to know new applications for developing online materials and then they should become aware of different ways to present them to online audience. This study tries to help ELT teachers to overcome challenges and difficulties of vodcasting by recognizing their social and biological motives (Activity Theory), and using Visual Thinking Strategies (VTS). It can alter teachers’ negative ...

متن کامل

Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding

The applications of digital chaotic maps in discrete-time chaotic cryptography and pseudo-random coding are widely studied recently. However, the statistical properties of digital chaotic maps are rather different from the continuous ones, which impedes the theoretical analyses of the digital chaotic ciphers and pseudo-random coding. This paper detailedly investigates the statistical properties...

متن کامل

Complexity Spaces Revisited

The complexity (quasi-pseudo-metric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ((Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in Sch95]. Typically these applications involve xed point arguments based on the Smyth completion. The notion of S-com...

متن کامل

Generalized bi-quasi-variational inequalities for quasi-pseudo-monotone type I operators on non-compact sets

In this paper, the authors prove some existence results of solutions for a new class of generalized bi-quasi-variational inequalities (GBQVI) for quasi-pseudo-monotone type I operators in non-compact settings in locally convex Hausdorff topological vector spaces. In obtaining these results on GBQVI for quasi-pseudo-monotone type I operators in non-compact settings, we shall use the concept of e...

متن کامل

Some Properties and Applications of Fuzzy Quasi-Pseudo-Metric Spaces

Abstract. In this paper we establish some properties of fuzzy quasi-pseudo-metric spaces. An important result is that any partial ordering can be defined by a fuzzy quasi-metric, which can be applied both in theoretical computer science and in information theory, where it is usual to work with sequences of objects of increasing information. We also obtain decomposition theorems of a fuzzy quasi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0804.1740  شماره 

صفحات  -

تاریخ انتشار 2008